A Relational Algebra for Basic Terms in a Higher-Order Logic
نویسندگان
چکیده
We define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that are well suited to the representation of heterogeneous data, irrespective of whether the data originated from relational, unstructured, semi-structured or structured sources. This higher-order generalisation of the relational model has potential applications in NoSQL databases and Big Variety, Big Data applications.
منابع مشابه
Higher-order frameworks for profiling and matching heterogeneous data
This Thesis brings together complementary research from higher-order computational logic and workflow systems to investigate software and theoretical frameworks for profiling and matching heterogeneous data. A motivating use case is submission sifting, which matches submitted conference or journal papers to potential peer reviewers based on the similarity between the paper’s abstract and the re...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملFirst-order unification using variable-free relational algebra
We present a framework for the representation and resolution of first-order unification problems and their abstract syntax in a variable-free relational formalism which is an executable variant of the Tarski-Givant relation algebra and of Freyd’s allegories restricted to the fragment necessary to compile and run logic programs. We develop a decision procedure for validity of relational terms, w...
متن کاملA Plot-Manipulation Algebra to Support Digital Storytelling
Plot composition is examined here at a logic design level, an intermediate stage that comes next to the conceptual level wherein the intended narrative genre is specified. An abstract data structure is proposed to represent plots, together with an algebra for manipulating the data structure. Our purpose is to adapt for narratives the strategy applied to databases by Codd's relational model. The...
متن کاملAn Extended Relational Algebra on Abstract Objects for Summarizing Answers to Queries
Answers to queries in terms of abstract objects are defined in the logical framework of first order predicate calculus. A partial algebraic characterisation of the supremum and of the infimum of abstract answers is given in an extended Relational Algebra of the Cylindric Algebra kind. Then, the form of queries is restricted in order to be able to compute answers without the cylindrification ope...
متن کامل